Special K
英 [ˈspeʃl keɪ]
美 [ˈspeʃl keɪ]
网络 全麦维
双语例句
- The shortest path algorithm, combined with the special nature of bandwidth allocation, refers to the double sweep algorithm and the Kth widest available bandwidth path section of the search process is proposed for the special circumstances of the subject algorithm process.
在最短路径算法中,结合带宽分配的特殊性,参考了二重扫除算法和第K条最大可用带宽路径算法的查找过程,提出了适合本课题特殊情况的算法过程。 - In § 2, according to the special operator form on HD_n space and QD_n space, we mainly calculate the K-groups of operator algebras B ( X) on the two types of spaces under certain conditions.
在§2中,主要根据HDn空间与QDn空间上特殊的算子构成,求出在一定条件下,这两类空间上算子代数B(X)的K群。 - A special strength analysis and fatigue life analysis are made for rig ′ s special structures such as K node of pipe braced structure and column structures, etc.
对平台特殊结构如K型管节点及支撑结构和立柱结构进行了强度分析和疲劳寿命分析。还研究了平台吃水数据采集、压载状态监测等技术。 - As a special cultural symbol,? r з b? k ( the pointed high hat) occupied an important position in the dress of ethnic groups in the ancient Western Region.
高尖帽作为一种特殊的文化符号,在古代西域诸民族的服饰文化中占有相当重要的地位。 - The sufficient property that Hamilton Circuit exists in the special and simple graph with 4 nodes is discussed. A conclusion is made that the ( 2 k-1)-canonical and simple graph with 4 nodes are Hamilton Graph.
讨论了特殊的4k(k>1)个结点的简单图中存在Hamilton回路的充分性,并由此提出:具有4k个结点的(2k-1)正则简单图都是Hamilton图。 - In the aspect of supervision, the paper especially refers to the special ways which is inspirational in supervising the 401 ( k) plan in the U.S.A.
在监管方面,特别提到了美国401(k)计划监管的独到之处,很具有启示性。 - The cause of forming water film and special mechanism is researched in depth on theory.
从理论上深入研究泥化夹层中水膜面的成因及特殊的力学机制,水膜面的不连续系数Kd对水膜面力学性质的影响; - Based on the phase mismatched frequency tripling, a special configuration is proposed to produce high order nonlinear phase shifts.
基于位相失配三倍频(Δk≠0)转换,构建了产生高阶非线性相移的χ(2)级联非线性过程。 - The defense can argue she took special "k" voluntarily to enhance sex.
辩方会借口说嗑药、上床都是她自愿的。 - The problem of pattern selection is NP-complete, so two algorithms of special condition are proposed and a heuristic algorithm is introduced. The complexity of the algorithm is O ( N 2s × k).
但此问题是NP完备的,因此提出了针对两种特殊情况的算法,并分析了求解一般问题的一启发式算法,此算法的计算复杂性为O(N2s×k)。